A Scatter Search Algorithm for the Slab Stack Shuffling Problem
نویسندگان
چکیده
Slab Stack Shuffling (SSS) problem is a kind of warehousing operations management problem abstracted from steel industry. SSS problem is to choose appropriate slabs for hot rolling schedule with the objective of minimizing shuffles during the retrieval process. Different from previous literatures, the substitute of slabs is a set of slabs which satisfy the given order demand. The problem in this paper considers balancing the shuffles between two sub-yards and the measurement of one shuffle is also different. The problem is formulated as an integer programming model by considering above practical requirements. The complexity of the model motivated us to develop a scatter search algorithm to solve the problem approximately. Problem-oriented coding scheme and solution combination method are proposed in scatter search. The computational results tested on real data show that the shuffles are decreased by 36.9% in average compared with the manual schedule.
منابع مشابه
Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
Available online 6 June 2009
متن کاملScenario-based Modeling Approach and Scatter Search Algorithm for the Stochastic Slab Allocation Problem in Steel Industry
A common problem encountered in steel companies is that of allocating the surplus slabs to customer orders so as to minimize the total cost of production and inventory. Due to many unpredictable events arising in practical manufacture environment, slab yields and customer demands are full of uncertainties. This paper focuses on such uncertainties and studies the stochastic version of the slab a...
متن کاملA Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors
Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملReheat furnace scheduling with energy consideration
This paper focuses on the reheat furnace scheduling problem (RFSP) which is to assign the slabs to the reheat furnace, make the slab sequence for each furnace and determine the feed-in time and the residence time for each slab in order to reduce the unnecessary energy consumption reflected by minimising the objective under consideration. Differing from the traditional scheduling problem, the ac...
متن کامل